Error threshold estimates for surface code with loss of qubits
نویسندگان
چکیده
منابع مشابه
High threshold error correction for the surface code.
An algorithm is presented for error correction in the surface code quantum memory. This is shown to correct depolarizing noise up to a threshold error rate of 18.5%, exceeding previous results and coming close to the upper bound of 18.9%. The time complexity of the algorithm is found to be polynomial with error suppression, allowing efficient error correction for codes of realistic sizes.
متن کاملLogic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
R. Barends,1, ∗ J. Kelly,1, ∗ A. Megrant,1 A. Veitia,2 D. Sank,1 E. Jeffrey,1 T. C. White,1 J. Mutus,1 A. G. Fowler,1, 3 B. Campbell,1 Y. Chen,1 Z. Chen,1 B. Chiaro,1 A. Dunsworth,1 C. Neill,1 P. O’Malley,1 P. Roushan,1 A. Vainsencher,1 J. Wenner,1 A. N. Korotkov,2 A. N. Cleland,1 and John M. Martinis1 Department of Physics, University of California, Santa Barbara, CA 93106, USA Department of E...
متن کاملError Correction with Euclidean Qubits
In classical case there is simplest method of error correction with using three equal bits instead of one. In the paper is shown, how the scheme fails for quantum error correction with complex vector spaces of usual quantum mechanics, but works in real and quaternionic cases. It is discussed also, how to implement the three qubits scheme with using encoding of quaternionic qubit by Majorana spi...
متن کاملError Estimates for a Bar Code Reconstruction Method
We analyze a variational method for reconstructing a bar code signal from a blurry and noisy measurement. The bar code is modeled as a binary function with a finite number of transitions and a parameter controlling minimal feature size. The measured signal is the convolution of this binary function with a Gaussian kernel. In this work, we assume that the blur kernel is known and establish condi...
متن کاملProof of finite surface code threshold for matching.
The field of quantum computation currently lacks a formal proof of experimental feasibility. Qubits are fragile and sophisticated quantum error correction is required to achieve reliable quantum computation. The surface code is a promising quantum error correction code, requiring only a physically reasonable 2D lattice of qubits with nearest neighbor interactions. However, existing proofs that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2012
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.85.060301